The Laplacian spectral radii of trees with degree sequences

نویسنده

  • Xiao-Dong Zhang
چکیده

In this paper, we characterize all extremal trees with the largest Laplacian spectral radius in the set of all trees with a given degree sequence. Consequently, we also obtain all extremal trees with the largest Laplacian spectral radius in the sets of all trees of order n with the largest degree, the leaves number and the matching number, respectively. © 2007 Elsevier B.V. All rights reserved. MSC: 05C50; 05C05; 15A48

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The (Signless Laplacian) Spectral Radii of Connected Graphs with Prescribed Degree Sequences

In this paper, some new properties are presented to the extremal graphs with largest (signless Laplacian) spectral radii in the set of all the connected graphs with prescribed degree sequences, via which we determine all the extremal tricyclic graphs in the class of connected tricyclic graphs with prescribed degree sequences, and we also prove some majorization theorems of tricyclic graphs with...

متن کامل

The p-Laplacian spectral radius of weighted trees with a degree sequence and a weight set

In this paper, some properties of the discrete p-Laplacian spectral radius of weighted trees have been investigated. These results are used to characterize all extremal weighted trees with the largest p-Laplacian spectral radius among all weighted trees with a given degree sequence and a positive weight set. Moreover, a majorization theorem with two tree degree sequences is presented.

متن کامل

Ela the P -laplacian Spectral Radius of Weighted Trees with a Degree Sequence and a Weight Set∗

In this paper, some properties of the discrete p-Laplacian spectral radius of weighted trees have been investigated. These results are used to characterize all extremal weighted trees with the largest p-Laplacian spectral radius among all weighted trees with a given degree sequence and a positive weight set. Moreover, a majorization theorem with two tree degree sequences is presented.

متن کامل

Recent results on the majorization theory of graph spectrum and topological index theory

Suppose π = (d1, d2, . . . , dn) and π = (d1, d ′ 2 , . . . , dn) are two positive nonincreasing degree sequences, write π ⊳ π if and only if π 6= π, ∑n i=1 di = ∑n i=1 d ′ i, and ∑j i=1 di ≤ ∑j i=1 di for all j = 1, 2, . . . , n. Let ρ(G) and μ(G) be the spectral radius and signless Laplacian spectral radius of G, respectively. Also let G and G be the extremal graphs with the maximal (signless...

متن کامل

SIGNLESS LAPLACIAN SPECTRAL MOMENTS OF GRAPHS AND ORDERING SOME GRAPHS WITH RESPECT TO THEM

Let $G = (V, E)$ be a simple graph. Denote by $D(G)$ the diagonal matrix $diag(d_1,cdots,d_n)$, where $d_i$ is the degree of vertex $i$  and  $A(G)$ the adjacency matrix of $G$. The  signless Laplacianmatrix of $G$ is $Q(G) = D(G) + A(G)$ and the $k-$th signless Laplacian spectral moment of  graph $G$ is defined as $T_k(G)=sum_{i=1}^{n}q_i^{k}$, $kgeqslant 0$, where $q_1$,$q_2$, $cdots$, $q_n$ ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete Mathematics

دوره 308  شماره 

صفحات  -

تاریخ انتشار 2008